Homotopy methods for multiplication modulo triangular sets

نویسندگان

  • Alin Bostan
  • Muhammad F. I. Chowdhury
  • Joris van der Hoeven
  • Éric Schost
چکیده

We study the cost of multiplication modulo triangular families of polynomials. Following previous work by Li, Moreno Maza and Schost, we propose an algorithm that relies on homotopy and fast evaluation-interpolation techniques. We obtain a quasi-linear time complexity for substantial families of examples, for which no such result was known before. Applications are given to notably addition of algebraic numbers in small characteristic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Homotopy techniques for multiplication modulo triangular sets

We study the cost of multiplication modulo triangular families of polynomials. Following previous work by Li, Moreno Maza and Schost, we propose an algorithm that relies on homotopy and fast evaluation-interpolation techniques. We obtain a quasi-linear time complexity for substantial families of examples, for which no such result was known before. Applications are given to notably addition of a...

متن کامل

The University of Western Ontario the School of Graduate and Postdoctoral Studies

Triangular representations are a versatile tool to manipulate systems of polynomial equations; however, many basic complexity questions are still open with respect to such objects. This matter of fact appears clearly with multiplication modulo triangular sets: it plays an essential part in algorithms for solving polynomial systems, but the cost of this operation remains difficult to estimate pr...

متن کامل

Computing GCDs of polynomials modulo triangular sets

We present a modular algorithm for computing GCDs of univariate polynomials with coefficients modulo a zero-dimensional triangular set. Our algorithm generalizes previous work for computing GCDs over algebraic number fields. The main difficulty is when a zero divisor is encountered modulo a prime number. We give two ways of handling this: Hensel lifting, and fault tolerant rational reconstructi...

متن کامل

An Elimination Algorithm for the Computation of All Zeros of a System of Multivariate Polynomial Equations

A direct numerical method is proposed for the determination of all isolated zeros of a system of multivariate polynomial equations. By “polynomial combination”, the system is reduced to a special form which may be interpreted as a multiplication table for power products modulo the system. The zeros are then formed from an ordinary eigenvalue problem for the matrix of the multiplication table. D...

متن کامل

Arens regularity of triangular Banach algebras related to homomorphisms

In this paper we first introduce a new multiplication on triangular Banach algebras. Then we study their Arens regularity as well as their topological centers . In this paper we first introduce a new multiplication on triangular Banach algebras. Then we study their Arens regularity as well as their topological centers . In this paper we first introduce a new multiplication on triangular Banach ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0901.3657  شماره 

صفحات  -

تاریخ انتشار 2009